An Efficient Hyperheuristic for Strip-Packing Problems
نویسندگان
چکیده
In this paper we introduce a hyperheuristic to solve hard strip packing problems. The hyperheuristic manages a sequence of greedy low-level heuristics, each element of the sequence placing a given number of objects. A low-level solution is built by placing the objects following the sequence of low-level heuristics. The hyperheuristic performs a hill-climbing algorithm on this sequence by testing different moves (adding, removing, replacing a low-level heuristic). The results we obtained are very encouraging and improve the results from the single heuristics tests. Thus, we conclude that the collaboration among heuristics is an interesting approach to solve hard strip packing problems.
منابع مشابه
An Evolutionary Hyperheuristic to Solve Strip-Packing Problems
In this paper we introduce an evolutionary hyperheuristic approach to solve difficult strip packing problems. We have designed a genetic based hyperheuristic using the most recently proposed low-level heuristics in the literature. Two versions for tuning parameters have also been evaluated. The results obtained are very encouraging showing that our approach outperforms the single heuristics and...
متن کاملCollaboration Between Hyperheuristics to Solve Strip-Packing Problems
In this paper we introduce a collaboration framework for hyperheuristics to solve hard strip packing problems. We have designed a genetic based hyperheuristic to cooperate with a hill-climbing based hyperheuristic. Both of them use the most recently proposed low-level heuristics in the literature. REVAC, which has recently been proposed for tuning [18], has been used to find the best operators ...
متن کاملA Comparative Study of Exact Algorithms for the Two Dimensional Strip Packing Problem
In this paper we consider a two dimensional strip packing problem. The problem consists of packing a set of rectangular items in one strip of width W and infinite height. They must be packed without overlapping, parallel to the edge of the strip and we assume that the items are oriented, i.e. they cannot be rotated. To solve this problem, we use three exact methods: a branch and bound method, a...
متن کاملConstructive and local-search based hyperheuristics: A case for hybridisation?
Hyperheuristics can be defined to be heuristics which choose between heuristics in order to solve a given optimisation problem or class of optimisation problems[5, 1]. One aim of using hyperheuristic methods is to achieve robustness, that is, to generate good-quality solutions for various problems or problem instances using the same method with very limited problem-specific knowledge. Over the ...
متن کاملA new metaheuristic genetic-based placement algorithm for 2D strip packing
Given a container of fixed width, infinite height and a set of rectangular block, the 2D-strip packing problem consists of orthogonally placing all the rectangles such that the height is minimized. The position is subject to confinement of no overlapping of blocks. The problem is a complex NP-hard combinatorial optimization, thus a heuristic based on genetic algorithm is proposed to solve it. I...
متن کامل